#include"Sort.h"
void test1()
{
	int a[] = { 5,6,8,9,1,2,3,4,7 };
	Printf(a, sizeof(a) / sizeof(int));
	InsertSort(a, sizeof(a) / sizeof(int));
	Printf(a, sizeof(a) / sizeof(int));

}

void test2()
{
	int a[] = { 5,6,8,9,1,2,3,4,7 };
	Printf(a, sizeof(a) / sizeof(int));
	BubbleSort(a, sizeof(a) / sizeof(int));
	Printf(a, sizeof(a) / sizeof(int));
}
void test3()
{
	int a[] = { 5,6,8,9,1,2,3,4,7 };
	Printf(a, sizeof(a) / sizeof(int));
	ShellSort(a, sizeof(a) / sizeof(int));
	Printf(a, sizeof(a) / sizeof(int));

}
void test4()
{
	int a[] = { 5,6,8,9,1,2,3,4,7 };
	Printf(a, sizeof(a) / sizeof(int));
	SelectSort(a, sizeof(a) / sizeof(int));
	Printf(a, sizeof(a) / sizeof(int));
}
void test()
{
	int a[] = { 5,6,8,9,1,2,3,4,7 };
	Printf(a, sizeof(a) / sizeof(int));
	QuickSort(a, 0,sizeof(a) / sizeof(int)-1);
	Printf(a, sizeof(a) / sizeof(int));
}
void TestQuickSort()
{
	//int a[] = { 5, 13, 9, 16, 12, 4, 7, 1, 28, 25, 3, 9, 6, 2, 4, 7, 1, 8 };
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };
	Printf(a, sizeof(a) / sizeof(int));
	QuickSort(a, 0, sizeof(a) / sizeof(int) - 1);
	Printf(a, sizeof(a) / sizeof(int));
}
void TestMergeSort()
{
	//int a[] = { 5, 13, 9, 16, 12, 4, 7, 1, 28, 25, 3, 9, 6, 2, 4, 7, 1, 8 };
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };
	//int a[] = { 10,6,7,1,3,9,4,2 };
	Printf(a, sizeof(a) / sizeof(int));
	MergeSortNonR(a,sizeof(a) / sizeof(int));
	Printf(a, sizeof(a) / sizeof(int));
}
void TestCountSort()
{
	//int a[] = { 5, 13, 9, 16, 12, 4, 7, 1, 28, 25, 3, 9, 6, 2, 4, 7, 1, 8 };
	int a[] = { 6,1,2,7,9,3,4,5,10,8 };
	//int a[] = { 10,6,7,1,3,9,4,2 };
	Printf(a, sizeof(a) / sizeof(int));
	CountSort(a, sizeof(a) / sizeof(int));
	Printf(a, sizeof(a) / sizeof(int));
}
void TestOP()
{
	srand(time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand() % N;
		//a1[i] = i;

		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
	}


	int begin7 = clock();
	BubbleSort(a7, N);
	//CountSort(a7, N);
	int end7 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();
	//PrintArray(a2, N);

	int begin5 = clock();
	//QuickSortNonR(a5, 0, N - 1);
	QuickSort2(a5, 0, N - 1);
	int end5 = clock();
	//PrintArray(a4, N);

	int begin6 = clock();
	MergeSort(a6, N);
	int end6 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	//printf("BubbleSort:%d\n", end7 - begin7);
	printf("CountSort:%d\n", end7 - begin7);

	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
}
int main()
{
	//TestInsertSort();
	//TestBubbleSort();
	//TestShellSort();
	//TestSelectSort();
	//TestQuickSort();
	//TestOP();
	//TestMergeSort();
	TestCountSort();
	return 0;
}